<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/set_algorithms/disjoint_set/disjointset_test.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('disjointset__test_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">disjointset_test.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="disjointset__test_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright 2016- huaxz &lt;huaxz1986@163.com&gt;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * the Free Software Foundation, either version 2 of the License, or</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Author: huaxz1986@163.com (huaxz)</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#ifndef DISJOINTSET_TEST</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#define DISJOINTSET_TEST</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include&quot;src/google_test/gtest.h&quot;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include&quot;<a class="code" href="disjointset_8h.html">disjointset.h</a>&quot;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="keyword">using</span> <a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html">IntroductionToAlgorithm::SetAlgorithm::DisjointSetNode</a>;</div>
<div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="namespaceanonymous__namespace_02disjointset__test_8h_03.html">   24</a></span>&#160;<span class="keyword">namespace </span>{</div>
<div class="line"><a name="l00025"></a><span class="lineno"><a class="line" href="namespaceanonymous__namespace_02disjointset__test_8h_03.html#a9fd4f77b008da8d9816385f53c064001">   25</a></span>&#160;    <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="namespaceanonymous__namespace_02disjointset__test_8h_03.html#a9fd4f77b008da8d9816385f53c064001">S_NUM</a>=20;</div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;}</div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;</div>
<div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="class_disjoint_set_node_test.html">   33</a></span>&#160;<span class="keyword">class </span><a class="code" href="class_disjoint_set_node_test.html">DisjointSetNodeTest</a>:<span class="keyword">public</span> ::testing::Test</div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;{</div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="class_disjoint_set_node_test.html#a2f0849289c8020ac6e4ef918b7f2cbde">   36</a></span>&#160;<span class="keyword">typedef</span> <a class="code" href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html">DisjointSetNode&lt;int&gt;</a> <a class="code" href="class_disjoint_set_node_test.html#a2f0849289c8020ac6e4ef918b7f2cbde">NodeType</a>;</div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="keyword">protected</span>:</div>
<div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="class_disjoint_set_node_test.html#a6deb2278f038f2fb93f33c9415d757e9">   38</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_disjoint_set_node_test.html#a6deb2278f038f2fb93f33c9415d757e9">SetUp</a>()</div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;    {</div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02disjointset__test_8h_03.html#a9fd4f77b008da8d9816385f53c064001">S_NUM</a>;i++) <span class="comment">//创建结点</span></div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;            <a class="code" href="class_disjoint_set_node_test.html#ae4bf8c2dd6ec1c63cdef65562fb5a278">nodes</a>[i]=std::make_shared&lt;NodeType&gt;(std::make_shared&lt;int&gt;(i));</div>
<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;    }</div>
<div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="class_disjoint_set_node_test.html#ab6fd5a639f421653273b483a30a3e264">   43</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_disjoint_set_node_test.html#ab6fd5a639f421653273b483a30a3e264">TearDown</a>(){}</div>
<div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="class_disjoint_set_node_test.html#ae4bf8c2dd6ec1c63cdef65562fb5a278">   44</a></span>&#160;    std::shared_ptr&lt;NodeType&gt; <a class="code" href="class_disjoint_set_node_test.html#ae4bf8c2dd6ec1c63cdef65562fb5a278">nodes</a>[<a class="code" href="namespaceanonymous__namespace_02disjointset__test_8h_03.html#a9fd4f77b008da8d9816385f53c064001">S_NUM</a>];    </div>
<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;};</div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;</div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;</div>
<div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="disjointset__test_8h.html#a05878d55a75a4d42bfb30e0e7102750c">   53</a></span>&#160;<a class="code" href="disjointset__test_8h.html#a05878d55a75a4d42bfb30e0e7102750c">TEST_F</a>(<a class="code" href="class_disjoint_set_node_test.html">DisjointSetNodeTest</a>,test_make_set)</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;{</div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;    EXPECT_THROW(NodeType::make_set(std::shared_ptr&lt;NodeType&gt;()),std::invalid_argument);</div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02disjointset__test_8h_03.html#a9fd4f77b008da8d9816385f53c064001">S_NUM</a>;i++)</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;    {</div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        NodeType::make_set(nodes[i]);</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        EXPECT_EQ(nodes[i]-&gt;rank,0);</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        EXPECT_EQ(nodes[i]-&gt;parent,nodes[i]);</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;    }</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;}</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;</div>
<div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="disjointset__test_8h.html#a84ca41c74c28df7548d2cce2c1e40ddb">   68</a></span>&#160;<a class="code" href="disjointset__test_8h.html#a05878d55a75a4d42bfb30e0e7102750c">TEST_F</a>(<a class="code" href="class_disjoint_set_node_test.html">DisjointSetNodeTest</a>,test_find_set)</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;{</div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;    EXPECT_THROW(NodeType::find_set(std::shared_ptr&lt;NodeType&gt;()),std::invalid_argument);</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02disjointset__test_8h_03.html#a9fd4f77b008da8d9816385f53c064001">S_NUM</a>;i++)</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;    {</div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;        NodeType::make_set(nodes[i]);</div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;        EXPECT_EQ(NodeType::find_set(nodes[i]),nodes[i]);</div>
<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;    }</div>
<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;}</div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;</div>
<div class="line"><a name="l00082"></a><span class="lineno"><a class="line" href="disjointset__test_8h.html#a58e773a7982757e03bde335d94a053d2">   82</a></span>&#160;<a class="code" href="disjointset__test_8h.html#a05878d55a75a4d42bfb30e0e7102750c">TEST_F</a>(<a class="code" href="class_disjoint_set_node_test.html">DisjointSetNodeTest</a>,test_link)</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;{</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02disjointset__test_8h_03.html#a9fd4f77b008da8d9816385f53c064001">S_NUM</a>;i++)</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;    {</div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        NodeType::make_set(nodes[i]);</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    }</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;    NodeType::link_set(nodes[0],nodes[1]);</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;    EXPECT_EQ(nodes[0]-&gt;parent,nodes[1]);</div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;    EXPECT_EQ(nodes[0]-&gt;rank,0);</div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;    EXPECT_EQ(nodes[1]-&gt;parent,nodes[1]);</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;    EXPECT_EQ(nodes[1]-&gt;rank,1);</div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;</div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;    EXPECT_THROW(NodeType::link_set(nodes[2],nodes[0]),std::invalid_argument);</div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;    NodeType::link_set(nodes[2],nodes[1]);</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;    EXPECT_EQ(nodes[2]-&gt;parent,nodes[1]);</div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;    EXPECT_EQ(nodes[2]-&gt;rank,0);</div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;    EXPECT_EQ(nodes[1]-&gt;parent,nodes[1]);</div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;    EXPECT_EQ(nodes[1]-&gt;rank,1);</div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;</div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;    EXPECT_EQ(NodeType::find_set(nodes[0]),nodes[1]);</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;    EXPECT_EQ(nodes[0]-&gt;parent,nodes[1]);</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;    EXPECT_EQ(NodeType::find_set(nodes[2]),nodes[1]);</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;    EXPECT_EQ(nodes[2]-&gt;parent,nodes[1]);</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;}</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;</div>
<div class="line"><a name="l00112"></a><span class="lineno"><a class="line" href="disjointset__test_8h.html#ae8efc2347c50e7173d77d7132bb6d0f3">  112</a></span>&#160;<a class="code" href="disjointset__test_8h.html#a05878d55a75a4d42bfb30e0e7102750c">TEST_F</a>(<a class="code" href="class_disjoint_set_node_test.html">DisjointSetNodeTest</a>,test_union)</div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;{</div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02disjointset__test_8h_03.html#a9fd4f77b008da8d9816385f53c064001">S_NUM</a>;i++)</div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;    {</div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;        NodeType::make_set(nodes[i]);</div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;    }</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=1;i&lt;S_NUM/3;i++)</div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;    {</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;        NodeType::union_set(nodes[i],nodes[0]);</div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;        EXPECT_EQ(nodes[0]-&gt;rank,1);</div>
<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;        EXPECT_EQ(nodes[i]-&gt;rank,0);</div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;        EXPECT_EQ(nodes[i]-&gt;parent,nodes[0]);</div>
<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;    }</div>
<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=S_NUM/3+1;i&lt;S_NUM*2/3;i++)</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;    {</div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;        NodeType::union_set(nodes[i],nodes[S_NUM/3]);</div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;        EXPECT_EQ(nodes[0]-&gt;rank,1);</div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;        EXPECT_EQ(nodes[i]-&gt;rank,0);</div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;        EXPECT_EQ(nodes[i]-&gt;parent,nodes[S_NUM/3]);</div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;    }</div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=S_NUM*2/3+1;i&lt;<a class="code" href="namespaceanonymous__namespace_02disjointset__test_8h_03.html#a9fd4f77b008da8d9816385f53c064001">S_NUM</a>;i++)</div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;    {</div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;        NodeType::union_set(nodes[i],nodes[S_NUM*2/3]);</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;        EXPECT_EQ(nodes[0]-&gt;rank,1);</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;        EXPECT_EQ(nodes[i]-&gt;rank,0);</div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;        EXPECT_EQ(nodes[i]-&gt;parent,nodes[S_NUM*2/3]);</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;    }</div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;</div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;    NodeType::union_set(nodes[S_NUM/3],nodes[0]);</div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;    EXPECT_EQ(nodes[S_NUM/3]-&gt;rank,1);</div>
<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;    EXPECT_EQ(nodes[S_NUM/3]-&gt;parent,nodes[0]);</div>
<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;    EXPECT_EQ(nodes[0]-&gt;rank,2);</div>
<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=S_NUM/3+1;i&lt;S_NUM*2/3;i++)</div>
<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;    {</div>
<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;        EXPECT_EQ(nodes[i]-&gt;rank,0);</div>
<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;        EXPECT_EQ(NodeType::find_set(nodes[i]),nodes[0]);<span class="comment">//路径压缩</span></div>
<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;        EXPECT_EQ(nodes[i]-&gt;parent,nodes[0]);</div>
<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;    }</div>
<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;}</div>
<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;</div>
<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;<span class="preprocessor">#endif // DISJOINTSET_TEST</span></div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;</div>
<div class="ttc" id="namespaceanonymous__namespace_02disjointset__test_8h_03_html_a9fd4f77b008da8d9816385f53c064001"><div class="ttname"><a href="namespaceanonymous__namespace_02disjointset__test_8h_03.html#a9fd4f77b008da8d9816385f53c064001">anonymous_namespace{disjointset_test.h}::S_NUM</a></div><div class="ttdeci">const int S_NUM</div><div class="ttdef"><b>Definition:</b> <a href="disjointset__test_8h_source.html#l00025">disjointset_test.h:25</a></div></div>
<div class="ttc" id="class_disjoint_set_node_test_html_ab6fd5a639f421653273b483a30a3e264"><div class="ttname"><a href="class_disjoint_set_node_test.html#ab6fd5a639f421653273b483a30a3e264">DisjointSetNodeTest::TearDown</a></div><div class="ttdeci">void TearDown()</div><div class="ttdef"><b>Definition:</b> <a href="disjointset__test_8h_source.html#l00043">disjointset_test.h:43</a></div></div>
<div class="ttc" id="class_disjoint_set_node_test_html"><div class="ttname"><a href="class_disjoint_set_node_test.html">DisjointSetNodeTest</a></div><div class="ttdoc">DisjointSetNodeTest:测试类，用于为测试提供基础数据 </div><div class="ttdef"><b>Definition:</b> <a href="disjointset__test_8h_source.html#l00033">disjointset_test.h:33</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node.html">IntroductionToAlgorithm::SetAlgorithm::DisjointSetNode</a></div><div class="ttdoc">DisjointSetNode：不相交集合森林的节点，算法导论第21章21.3节 </div><div class="ttdef"><b>Definition:</b> <a href="disjointset_8h_source.html#l00054">disjointset.h:54</a></div></div>
<div class="ttc" id="class_disjoint_set_node_test_html_a2f0849289c8020ac6e4ef918b7f2cbde"><div class="ttname"><a href="class_disjoint_set_node_test.html#a2f0849289c8020ac6e4ef918b7f2cbde">DisjointSetNodeTest::NodeType</a></div><div class="ttdeci">DisjointSetNode&lt; int &gt; NodeType</div><div class="ttdef"><b>Definition:</b> <a href="disjointset__test_8h_source.html#l00036">disjointset_test.h:36</a></div></div>
<div class="ttc" id="class_disjoint_set_node_test_html_ae4bf8c2dd6ec1c63cdef65562fb5a278"><div class="ttname"><a href="class_disjoint_set_node_test.html#ae4bf8c2dd6ec1c63cdef65562fb5a278">DisjointSetNodeTest::nodes</a></div><div class="ttdeci">std::shared_ptr&lt; NodeType &gt; nodes[S_NUM]</div><div class="ttdef"><b>Definition:</b> <a href="disjointset__test_8h_source.html#l00044">disjointset_test.h:44</a></div></div>
<div class="ttc" id="disjointset__test_8h_html_a05878d55a75a4d42bfb30e0e7102750c"><div class="ttname"><a href="disjointset__test_8h.html#a05878d55a75a4d42bfb30e0e7102750c">TEST_F</a></div><div class="ttdeci">TEST_F(DisjointSetNodeTest, test_make_set)</div><div class="ttdoc">DisjointSetNodeTest:测试DisjointSetNodeTest. </div><div class="ttdef"><b>Definition:</b> <a href="disjointset__test_8h_source.html#l00053">disjointset_test.h:53</a></div></div>
<div class="ttc" id="class_disjoint_set_node_test_html_a6deb2278f038f2fb93f33c9415d757e9"><div class="ttname"><a href="class_disjoint_set_node_test.html#a6deb2278f038f2fb93f33c9415d757e9">DisjointSetNodeTest::SetUp</a></div><div class="ttdeci">void SetUp()</div><div class="ttdef"><b>Definition:</b> <a href="disjointset__test_8h_source.html#l00038">disjointset_test.h:38</a></div></div>
<div class="ttc" id="disjointset_8h_html"><div class="ttname"><a href="disjointset_8h.html">disjointset.h</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_0ebe04a029d2a003f5554846f5eef60c.html">set_algorithms</a></li><li class="navelem"><a class="el" href="dir_4b08b44a26a78dfc2b0efd68fb1ec5c4.html">disjoint_set</a></li><li class="navelem"><a class="el" href="disjointset__test_8h.html">disjointset_test.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
